Learning Meanings for Sentences with Recursive Autoencoders

نویسندگان

  • Tsung-Yi Lin
  • Chen-Yu Lee
چکیده

The objective of this project is to implement the recursive auto encoder (RAE) method to learn a model to predict sentiments for sentences and reproduce the result in [1]. To learn the weights for recursive functions, we implement forward and backward propagation algorithms. We validate the gradient computed from forward and backward algorithm by comparing it to the gradient computed from numerical approximation. Our implementation could achieve accuracy 48.5% with the basic RAE implementation. We show that the system achieves accuracy 76.0% by using normalized transfer function and adjustable meaning vectors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Meanings for Sentences with Recursive Autoencoders

In this report, we learn a model to predict sentiments for sentences by SemiSupervised Recursive Autoencoders (RAE) and reproduce the result in [1]. We use greedy algorithm to construct the tree structure in neural networks and forward and backward propagation to compute the gradients of weights. Using meaning vectors of length 20, we achieve 75.4% accuracy in the movie reviews (MR) dataset, wh...

متن کامل

Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection

Paraphrase detection is the task of examining two sentences and determining whether they have the same meaning. In order to obtain high accuracy on this task, thorough syntactic and semantic analysis of the two statements is needed. We introduce a method for paraphrase detection based on recursive autoencoders (RAE). Our unsupervised RAEs are based on a novel unfolding objective and learn featu...

متن کامل

Sentence Alignment using Unfolding Recursive Autoencoders

In this paper, we propose a novel two step algorithm for sentence alignment in monolingual corpora using Unfolding Recursive Autoencoders. First, we use unfolding recursive auto-encoders (RAE) to learn feature vectors for phrases in syntactical tree of the sentence. To compare two sentences we use a similarity matrix which has dimensions proportional to the size of the two sentences. Since the ...

متن کامل

AMRITA_CEN$@$SemEval-2015: Paraphrase Detection for Twitter using Unsupervised Feature Learning with Recursive Autoencoders

We explore using recursive autoencoders for SemEval 2015 Task 1: Paraphrase and Semantic Similarity in Twitter. Our paraphrase detection system makes use of phrase-structure parse tree embeddings that are then provided as input to a conventional supervised classification model. We achieve an F1 score of 0.45 on paraphrase identification and a Pearson correlation of 0.303 on computing semantic s...

متن کامل

Bootstrapping structure into language : alignment-based learning

. . . refined and abstract meanings largely grow out of more concrete meanings. — Bloomfield (1933) This thesis introduces a new unsupervised learning framework, called AlignmentBased Learning, which is based on the alignment of sentences and Harris’s (1951) notion of substitutability. Instances of the framework can be applied to an untagged, unstructured corpus of natural language sentences, r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013